A More Efficient Approximation Scheme for Tree Alignment
نویسندگان
چکیده
منابع مشابه
Improved Approximation Algorithms for Tree Alignment
Multiple sequence alignment is a task at the heart of much of current computaw x tional biology 4 . Several different objective functions have been proposed to formalize the task of multiple sequence alignment, but efficient algorithms are lacking in each case. Thus multiple sequence alignment is one of the most critical, essentially unsolved problems in computational biology. In this paper we ...
متن کاملApproximation algorithms for constrained generalized tree alignment problem
In generalized tree alignment problem, we are given a set S of k biologically related sequences and we are interested in a minimum cost evolutionary tree for S. In many instances of this problem partial topology of the phylogenetic tree for S is known. In such instances, we would like to make use of this knowledge to restrict the tree topologies that we consider and construct a biologically rel...
متن کاملSuffix Tree of Alignment: An Efficient Index for Similar Data
We consider an index data structure for similar strings. The generalized suffix tree can be a solution for this. The generalized suffix tree of two strings A and B is a compacted trie representing all suffixes in A and B. It has |A|+ |B| leaves and can be constructed in O(|A|+ |B|) time. However, if the two strings are similar, the generalized suffix tree is not efficient because it does not ex...
متن کاملEfficient D2D Discovery Scheme for Channel Measurement of Interference Alignment
Co-channel interference among Device-to-device (D2D) users is major issue to be solved when utilizing the same frequency bands. Consequently, interference alignment (IA) as an effective interference management approach has been implemented to D2D communications for the frequency sharing. However, the measurement of channel state information (CSI) between transmitter and receiver of a D2D pair a...
متن کاملTR-2008015: An Efficient Heuristic for the Tree Alignment Problem
Phylogeny and alignment estimation are two important and closely related biological problems. One approach to the alignment question is known in combinatorial optimization as the Tree Alignment Problem (TAP). A number of heuristic solutions exist, with the most competitive algorithms using iterative methods to find solutions. However, these methods are either non-scalable, the bound is too loos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2000
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539796313507